Computation of condition numbers for linear programming problems using Peña's method

نویسندگان

  • Joo-siong Chai
  • Kim-chuan Toh
چکیده

We present the computation of the condition numbers for linear programming (LP) problems from the NETLIB suite. The method of Peña [Technical report, Center for Applied Mathematics, Cornell University, May 1998] was used to compute the bounds on the distance to ill-posedness ρ(d) of a given problem instance with data d, and the condition number was computed as C(d) = ‖d‖/ρ(d). We discuss the efficient implementation of Peña’s method and compare the tightness of the estimates on C(d) computed by Peña’s method to that computed by the method employed by Ordóñez and Freund [SIAM J. Optimization, 14 (2003), pp. 307–333]. While Peña’s method is generally much cheaper, the bounds provided are generally not as tight as those computed by Ordóñez and Freund. As a by-product, we use the computational results to study the correlation between logC(d) and the number of IPM iterations taken to solve a LP problem instance. Our computational findings on the preprocessed problem instances from NETLIB suite are consistent with those reported by Ordóñez and Freund.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach to Solve Fully Fuzzy Linear Programming with Trapezoidal Numbers Using Conversion Functions

Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...

متن کامل

Some new results on semi fully fuzzy linear programming problems

There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...

متن کامل

Defuzzification Method for Solving ‎Fuzzy ‎Linear Programming Problems

Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...

متن کامل

A new method for solving fully fuzzy linear Bilevel programming problems

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...

متن کامل

Fully Fuzzy Transportation Problem

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Optimization Methods and Software

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2006